Transport Routes Optimization in Martinez de la Torre, Veracruz City, Using Dijkstra's Algorithm with an Additional Parameter

A solution to the shortest path problem in Martinez de la Torre, a city in the state of Veracruz, Mexico, is presented. Dijkstra’s algorithm was applied to find the shortest route and additional parameter that is used to choose the optimal route was also added. The shortest path problem is a specific case of optimization problems and can be addressed using graph theory. From a computational point of view, graphs are data structures that can be treated as arrays, tables or lists. On the other hand, several organizations in Martinez de la Torre face the problem of finding the optimal route to reduce time and cost, and to offer a better service to its customers. This article addresses the problem of finding an optimal route and implementing the solution to a small portion (area of interest) of Martinez de la Torre City, to test the algorithm and analyze the results, and ultimately leading to a detailed analysis that covers the whole city.